Finding short cycles in embedded graph in polynomial time
نویسندگان
چکیده
منابع مشابه
Finding Short Cycles in an Embedded Graph in Polynomial Time
Let C1 be the set of fundamental cycles of breadth-first-search trees in a graph G and C2 the set of the sums of two cycles in C1. Then we show that (1).C = C1 ⋃ C2 contains a shortest Π-twosided cycle in a Π-embedded graph G.This implies the existence of a polynomially bounded algorithm to find a shortest Π−twosided cycle in an embedded graph and thus solves an open problem of Mohar and Thomas...
متن کاملFinding a Simple Polytope from Its Graph in Polynomial Time
We show that one can compute the combinatorial facets of a simple polytope from its graph in polynomial time. Our proof relies on a primal-dual characterization (by Joswig, Kaibel and Korner) and a linear program, with an exponential number of constraints, which can be used to construct the solution and can be solved in polynomial time. We show that this allows one to characterize the face latt...
متن کاملOn Finding Short Cycles in Cryptographic Algorithms
We show how short cycles in the state space of a cryptographic algorithm can be used to mount a fault attack on its implementation which results in a full secret key recovery. The attack is based on the assumption that an attacker can inject a transient fault at a precise location and time of his/her choice and more than once. We present an algorithm which uses a SAT-based bounded model checkin...
متن کاملFinding Relations in Polynomial Time
Given a set of m observations on n variables, an 0(mn) algorithm is proposed to find a basis of all affine relations between these variables satisfied by the observations. On a 25 variables example, this new algorithm is 130 000 times faster than the "all subsets" option for linear regression of the SAS package which is a non polynomial alternative. Extension to the cases where squares, ratios,...
متن کاملFinding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k ≥ 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is related to the distance of the graph from being Ck-minor free (resp., free from having the corresponding tree-minor). In particular, if the graph is Ω(1)-far from being cycle-free (i.e., a constant fraction of the ed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers of Mathematics in China
سال: 2010
ISSN: 1673-3452,1673-3576
DOI: 10.1007/s11464-010-0003-y